An improved equation relating hardness to ultimate strength
نویسندگان
چکیده
منابع مشابه
An Improved ISM Equation of State for Polar Fluids
We developed an equation of state (EOS) by Ihm, Song, and Mason (ISM) for polar fluids. The model consists of four parameters, namely, the second virial coefficient, an effective van der Waals co-volume, a scaling factor, and the reduced dipole moment. The second virial coefficient is calculated from a correlation that uses the heat of vaporization, and the liquid density at the normal boiling ...
متن کاملUltimate tensile strength of tooth structures.
OBJECTIVE This study determined the ultimate tensile strength (UTS) of enamel (E), dentin (D) and dentin-enamel junction (DEJ) using the microtensile technique. It was hypothesized that the UTS of dental structures varies according to location and nature. METHODS Intact occlusal enamel surfaces from extracted human third molars were etched with 37% phosphoric acid and bonded with a one-bottle...
متن کاملAn Improved Pseudorandom Generator Based on Hardness of Factoring
We present a simple to implement and efficient pseudorandom generator based on the factoring assumption. It outputs more than pn/2 pseudorandom bits per p exponentiations, each with the same base and an exponent shorter than n/2 bits. Our generator is based on results by H̊astad, Schrift and Shamir [HSS93], but unlike their generator and its improvement by Goldreich and Rosen [GR00], it does not...
متن کاملPrediction of ultimate strength of shale using artificial neural network
A rock failure criterion is very important for prediction of the ultimate strength in rock mechanics and geotechnics; it is determined for rock mechanics studies in mining, civil, and oil wellborn drilling operations. Also shales are among the most difficult to treat formations. Therefore, in this research work, using the artificial neural network (ANN), a model was built to predict the ultimat...
متن کاملRelating Proof Complexity Measures and Practical Hardness of SAT
Boolean satisfiability (SAT) solvers have improved enormously in performance over the last 10–15 years and are today an indispensable tool for solving a wide range of computational problems. However, our understanding of what makes SAT instances hard or easy in practice is still quite limited. A recent line of research in proof complexity has studied theoretical complexity measures such as leng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Metallurgical and Materials Transactions B
سال: 1972
ISSN: 1073-5615,1543-1916
DOI: 10.1007/bf02652880